An enhanced variable-fidelity optimization approach for constrained optimization problems and its parallelization

نویسندگان

چکیده

Abstract In this paper, a variable-fidelity constrained lower confidence bound (VF-CLCB) criterion is presented for computationally expensive optimization problems (COPs) with two levels of fidelity. VF-CLCB, the hierarchical Kriging model adopted to objective and inequality constraints. Two infill sampling functions are developed based on constraints, respectively, an adaptive selection strategy set select elite sample points. Moreover, VF-CLCB criterion, parallel method noted as PVF-CLCB subsequently accelerate process. PVF-CLCB, VF influence function defined approximately evaluate estimation error models, which multiple promising points can be determined at each iteration. addition, allocation proposed distribute computation resources between objective- constraint-oriented properly. Lastly, approaches compared alternative methods 12 benchmark numerical cases, their significant superiority in solving COPs verified. Furthermore, employed optimize global stability stiffened cylindrical shell, optimum structure yielded.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An enhanced aggregation method for stress-constrained topology optimization problems

1. Abstract For the topology optimization with local stress constraints on all the elements, conventional “global constraint methods” may introduce high nonlinearity to the global constraint function and cannot adequately control the local stress state. This study aims to develop an enhanced aggregation method that not only effectively reduces the number of constraints in the search process, bu...

متن کامل

An Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems

In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...

متن کامل

COMPUTER CODES FOR COLLIDING BODIES OPTIMIZATION AND ITS ENHANCED VERSION

Colliding bodies optimization (CBO) is a new population-based stochastic optimization algorithm based on the governing laws of one dimensional collision between two bodies from the physics. Each agent is modeled as a body with a specified mass and velocity. A collision occurs between pairs of objects to find the global or near-global solutions. Enhanced colliding bodies optimization (ECBO) uses...

متن کامل

Filter Pattern Search Algorithms for Mixed Variable Constrained Optimization Problems

A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-Dennis Generalized Pattern Search (GPS) algorithms for bound constrained mixed variable optimization, and their GPS-filter algorithms for general nonlinear constraints. In generalizing existing algorithms, new theoretical convergence results ...

متن کامل

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Structural and Multidisciplinary Optimization

سال: 2022

ISSN: ['1615-1488', '1615-147X']

DOI: https://doi.org/10.1007/s00158-022-03283-0